Three possible diffused words in Amerindian languages
نویسندگان
چکیده
منابع مشابه
Real Words, Possible Words, and New Words
Phonologists and psycholinguists draw a three-way distinction amongst real words, possible words, and impossible words.The distinction between real words and possible words provides the foundation for lexical decision experiments. The distinction between possible words and impossible words reveals implicit cognitive generalizations about words in a language, and thereby contributes to the under...
متن کاملRegular languages of partial words
We initiate a study of languages of partial words related to regular languages of full words. First, we investigate the possibility of expressing a regular language of full words as the image of a partial-words-language through a substitution that only replaces the hole symbols of the partial words by a finite set of letters. Results regarding the structure, uniqueness and succinctness of such ...
متن کاملLanguages Obtained from Infinite Words
Answering two problems formulated by Marcus and P aun, we prove that it is decidable whether or not a context-free language can be written as the set of all nite pre xes of an in nite word and that it is decidable whether or not a regular language can be written as the set of all nite subwords of an in nite word. TUCS Research Group Mathematical Structures of Computer Science
متن کاملStrategical languages of infinite words
We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existence of a minimal strategy for such languages, for which we give an explicit expression. Then we characterize the family of strategical languages as that of closed ones, in the topological space of infinite words. Finally,...
متن کاملEfficient enumeration of words in regular languages
The cross-section enumeration problem is to list all words of length n in a regular language L in lexicographical order. The enumeration problem is to list the rst m words in L according to radix order. We present an algorithm for the crosssection enumeration problem that is linear in n + t, where t is the output size. We provide a detailed analysis of the asymptotic running time of our algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Work Papers of the Summer Institute of Linguistics, University of North Dakota Session
سال: 1973
ISSN: 0361-4700
DOI: 10.31356/silwp.vol17.09